منابع مشابه
On Infinitary Finite Length Codes
For a code CcX* the following four conditions are considered: (i) for ail words u, v, in X* and for every word w in C*, wu, uv, vu in C* imply u, v in C*. (ii) every onesided infinité product of words of C is unambiguous. (Ui) C has flnite decoding delay. (iv) C has bounded decoding delay. lt is shown that in gênerai (iv) —> (Ui) —• (ii) -* (ï), and the reverse implications are not true; wherea...
متن کاملFinite Proofs for Infinitary Formulas
Recent work has shown that the infinitary logic of hereand-there is closely related to the input language of the ASP grounder gringo. A formal system axiomatizing that logic exists, but a proof in that system may include infinitely many formulas. In this note, we define a correspondence between the validity of infinitary formulas in the logic of here-and-there and the provability of formulas in...
متن کاملFinite-Length Scaling and Finite-Length Shift for Low-Density Parity-Check Codes
Consider communication over the binary erasure channel BEC(ǫ) using random low-density parity-check codes with finite-blocklength n from ‘standard’ ensembles. We show that large error events is conveniently described within a scaling theory, and explain how to estimate heuristically their effect. Among other quantities, we consider the finite length threshold ǫ∗(n), defined by requiring a block...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملRedundancy allocation in finite-length nested codes for nonvolatile memories
In this paper, we investigate the optimum way to allocate redundancy of finite-length nested codes for modern nonvolatile memories suffering from both permanent defects and transient errors (erasures or random errors). A nested coding approach such as partitioned codes can handle both permanent defects and transient errors by using two parts of redundancy: 1) redundancy to deal with permanent d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1986
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1986200404831